math/big.Rat.b (field)

89 uses

	math/big (current package)
		float.go#L1154: 			z.b.abs = z.b.abs[:0] // == 1 (see Rat)
		float.go#L1158: 			z.b.abs = z.b.abs[:0] // == 1 (see Rat)
		float.go#L1162: 			t := z.b.abs.setUint64(1)
		float.go#L1163: 			z.b.abs = t.lsh(t, uint(allBits-x.exp))
		rat.go#L29: 	a, b Int
		rat.go#L64: 	z.b.Set(intOne)
		rat.go#L66: 		z.b.Lsh(&z.b, uint(shift))
		rat.go#L274: 	b := x.b.abs
		rat.go#L292: 	b := x.b.abs
		rat.go#L317: 	z.b.abs = z.b.abs.set(babs)
		rat.go#L332: 	z.b.abs = z.b.abs.setUint64(uint64(b))
		rat.go#L339: 	z.b.abs = z.b.abs.setWord(1)
		rat.go#L346: 	z.b.abs = z.b.abs.setWord(1)
		rat.go#L353: 	z.b.abs = z.b.abs.setWord(1)
		rat.go#L361: 		z.b.Set(&x.b)
		rat.go#L363: 	if len(z.b.abs) == 0 {
		rat.go#L364: 		z.b.abs = z.b.abs.setWord(1)
		rat.go#L390: 	z.a.abs, z.b.abs = z.b.abs, z.a.abs
		rat.go#L404: 	return len(x.b.abs) == 0 || x.b.abs.cmp(natOne) == 0
		rat.go#L424: 	if len(x.b.abs) == 0 {
		rat.go#L430: 	return &x.b
		rat.go#L439: 	case len(z.b.abs) == 0:
		rat.go#L441: 		z.b.abs = z.b.abs.setWord(1)
		rat.go#L448: 		z.b.neg = false
		rat.go#L449: 		if f := NewInt(0).lehmerGCD(nil, nil, &z.a, &z.b); f.Cmp(intOne) != 0 {
		rat.go#L451: 			z.b.abs, _ = z.b.abs.div(stk, nil, z.b.abs, f.abs)
		rat.go#L492: 	a.scaleDenom(stk, &x.a, y.b.abs)
		rat.go#L493: 	b.scaleDenom(stk, &y.a, x.b.abs)
		rat.go#L503: 	a1.scaleDenom(stk, &x.a, y.b.abs)
		rat.go#L504: 	a2.scaleDenom(stk, &y.a, x.b.abs)
		rat.go#L506: 	z.b.abs = mulDenom(stk, z.b.abs, x.b.abs, y.b.abs)
		rat.go#L516: 	a1.scaleDenom(stk, &x.a, y.b.abs)
		rat.go#L517: 	a2.scaleDenom(stk, &y.a, x.b.abs)
		rat.go#L519: 	z.b.abs = mulDenom(stk, z.b.abs, x.b.abs, y.b.abs)
		rat.go#L532: 		if len(x.b.abs) == 0 {
		rat.go#L533: 			z.b.abs = z.b.abs.setWord(1)
		rat.go#L535: 			z.b.abs = z.b.abs.sqr(stk, x.b.abs)
		rat.go#L541: 	z.b.abs = mulDenom(stk, z.b.abs, x.b.abs, y.b.abs)
		rat.go#L555: 	a.scaleDenom(stk, &x.a, y.b.abs)
		rat.go#L556: 	b.scaleDenom(stk, &y.a, x.b.abs)
		rat.go#L558: 	z.b.abs = b.abs
		ratconv.go#L71: 		if z.b.abs, _, _, err = z.b.abs.scan(r, 0, false); err != nil {
		ratconv.go#L78: 		if len(z.b.abs) == 0 {
		ratconv.go#L184: 		pow5 := z.b.abs.expNN(stk, natFive, nat(nil).setWord(Word(n)), nil, false) // use underlying array of z.b.abs
		ratconv.go#L187: 			z.b.abs = z.b.abs.setWord(1)
		ratconv.go#L189: 			z.b.abs = pow5
		ratconv.go#L192: 		z.b.abs = z.b.abs.setWord(1)
		ratconv.go#L202: 		z.b.abs = z.b.abs.lsh(z.b.abs, uint(-exp2))
		ratconv.go#L314: 	if len(x.b.abs) != 0 {
		ratconv.go#L315: 		buf = x.b.Append(buf, 10)
		ratconv.go#L351: 	q, r := nat(nil).div(stk, nat(nil), x.a.abs, x.b.abs)
		ratconv.go#L359: 	r, r2 := r.div(stk, nat(nil), r, x.b.abs)
		ratconv.go#L363: 	if x.b.abs.cmp(r2) <= 0 {
		ratmarsh.go#L24: 	buf := make([]byte, 1+4+(len(x.a.abs)+len(x.b.abs))*_S) // extra bytes for version and sign bit (1), and numerator length (4)
		ratmarsh.go#L25: 	i := x.b.abs.bytes(buf)
		ratmarsh.go#L67: 	z.b.abs = z.b.abs.setBytes(buf[i:])